Region Coverage for Planar Sensor Network Via Sensing Sectors
نویسندگان
چکیده
In this paper, asymptotical k-coverage of a planar sensor network with a sensing sector assigned to each node/sensor is considered. Sufficient conditions of the node density for the complete k-covering with probability approaching 1 are proposed when nodes deployment forms a planar Poisson point process and the sensing area of each node only covers a sector of a certain angle. Both fixed and varying sector direction cases are investigated, and related comparisons are also shown.
منابع مشابه
Improvement of Coverage Algorithm in WSN in Terms of Sensor Numbers and Power Amount
Wireless sensor networks(WSN) have unique properties that distinguished them from other wireless networks and have special challenges. Not-chargeable, not-changeable and limited power supplies of sensor nodes is the most important challenge of this networks, and if the power supply of node expired, a part of data maybe lost. Because of the importance of covers in wireless sensors, in this work ...
متن کاملCoverage Hole Problem Under Sensing Topology In Wireless Sensor Network
In wireless sensor networks, one of the fundamental issues is the coverage problem. This is, whether a given region can be sufficiently covered by sensing disks of sensors? In this paper, we discuss the coverage-hole problem by using a sensing topology. From the sensing topology, we figure out the relation between the graph Gn,n+i and coverage holes, and obtain that if m <3n/2-(5-(-1)n)/4, ther...
متن کاملOn the Coverage and Detectability of Large-scale Wireless Sensor Networks
Advances in sensor and communication technologies have made it possible to manufacture small sensors with sensing, processing, and wireless communication capabilities in a costeffective fashion. A sensor network can be formed by deploying specialized sensors in the region of interest to perform certain sensing and networking tasks. Application scenarios of wireless sensor networks include battl...
متن کاملCluster Based Object Detection in Wireless Sensor Network
Sensing and coverage are the two relevant tasks for a sensor network. Quality of sensor network totally depends upon the sensing ability of sensors. In a certain monitored region success of detecting or sensing an object with the help of sensor network tells that how efficiently the network coverage perform. Here in this paper we have proposed a clustering algorithm for the deployment of sensor...
متن کاملMinimizing the Range for k-Covered Paths on Sensor Networks
Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field of wireless sensor networks. The main coverage issue centres around critical conditions that require reliable monitoring and prohibit failures. This issue can be addressed by maximal-exposure paths, regarding which this article presents new results. Namely, it shows how to minimize the sensing ...
متن کامل